Process Algebra: An Algebraic Theory of Concurrency
نویسنده
چکیده
This tutorial provides an overview of the process algebra ACP.
منابع مشابه
Algebraic Laws for True Concurrency
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True Concurrency), APTC (Algebra for Parallelism in True Concurrency), recursion and abstraction. And also, we show the applications and extensions of APTC.
متن کاملNotes on P - Algebra ( 4 ) : Algebra over ProcessStructure , Part I .
We develop theory of algebra over processes, based on an abstract treatment of process structure. The abstract framework of process structures is developed (Part I), and, on its basis, theory of algebra is developed where the basic results including Birkho -like Variety Theorem are proved (Part II). We also discuss properties of signi cant concrete examples of algebras, taken from extant theori...
متن کاملRough ideals based on ideal determined varieties
The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...
متن کاملProcess Algebra for Synchronous Communication
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite system behind the communication algebra is shown to be confluent and terminating (modulo its perm...
متن کاملWeak Concurrent Kleene Algebra with Application to Algebraic Verification
We propose a generalisation of concurrent Kleene algebra [5] that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted η-simulation equivalence. Applicability is demonstrated by algebraic treatments of two examples: algebraic may testing and Rabin’s solution to the choice coordination...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009